Turing machine takes the intuition conception of feasible computability into strict formality and the "Church-Turing Thesis" that "any feasible computability function is universal Turing machine computability" is come into being. 图灵机把关于能行可计算的直观看法变成了严格的形式定义,于是形成了任何能行可计算的函数都是通用图灵机可计算的这一丘奇-图灵论题。